Cube-approximating bounded wavelet sets in $\mathbb{R}^{n}$
نویسندگان
چکیده
منابع مشابه
FUZZY BOUNDED SETS AND TOTALLY FUZZY BOUNDED SETS IN I-TOPOLOGICAL VECTOR SPACES
In this paper, a new definition of fuzzy bounded sets and totallyfuzzy bounded sets is introduced and properties of such sets are studied. Thena relation between totally fuzzy bounded sets and N-compactness is discussed.Finally, a geometric characterization for fuzzy totally bounded sets in I- topologicalvector spaces is derived.
متن کاملfuzzy bounded sets and totally fuzzy bounded sets in i-topological vector spaces
in this paper, a new definition of fuzzy bounded sets and totallyfuzzy bounded sets is introduced and properties of such sets are studied. thena relation between totally fuzzy bounded sets and n-compactness is discussed.finally, a geometric characterization for fuzzy totally bounded sets in i- topologicalvector spaces is derived.
متن کاملApproximating Bounded Occurrence Ordering CSPs
A theorem of Håstad shows that for every constraint satisfaction problem (CSP) over a fixed size domain, instances where each variable appears in at most O(1) constraints admit a non-trivial approximation algorithm, in the sense that one can beat (by an additive constant) the approximation ratio achieved by the naive algorithm that simply picks a random assignment. We consider the analogous que...
متن کاملApproximating Extended Answer Sets
We present an approximation theory for the extended answer set semantics, using the concept of an approximation constraint. Intuitively, an approximation constraint, while satisfied by a “perfect” solution, may be left unsatisfied in an approximate extended answer set. Approximations improve as the number of unsatisfied constraints decreases. We show how the framework can also capture the class...
متن کاملApproximating Minimum Feedback Sets
This paper deals with approximating feedback sets in directed graphs. We consider two related problems: the weighted feedback vertex set (fvs) problem, and the weighted feedback edge set problem (fes). In the fvs (resp. fes) problem, one is given a directed graph with weights on the ver-tices (resp. edges), and is asked to nd a subset of vertices (resp. edges) with minimum total weight that int...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 2005
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-05-08037-8